Learning Ensemble Models on Categorized Datasets.

Consistency%2C comprehensiveness%2C and compatibility of pathway databases.

RECA Referenced energy%2Dbased CDS algorithm in wireless sensor networks.

Dynamic Data Mining A Novel Data Mining Process Model.

Dynamic Data Mining A Novel Data Mining Process Model.



Analysing scientific workflows with Computational Tree Logic.

Heterogeneous Workflows in Scientific Workflow Systems.

Supporting scientific discovery processes in Discovery Net.

Grid%2DOriented Storage A Single%2DImage

Building Next Generation Service%2DOriented Architectures using Argumentation Agents.

Achievements and Experiences from a Grid%2DBased Earthquake Analysis and Modelling Study.

KDE Bioscience Platform for bioinformatics analysis workflows.

KDE Bioscience Platform for bioinformatics analysis workflows.

A grid infrastructure for mixed bioinformatics data and text mining.

The use of Business Rules with Workflow Systems.

Bridging the Macro and Micro A Computing Intensive Earthquake Study Using Discovery Net.
We present the development and use of a novel distributed geohazard modeling environment for the analysis and interpretation of large scale earthquake data sets. Our work demonstrates, for the first time, how earthquake-related surface deformation measured from satellite images using imageodesy algorithms is coupled with analysis and simulation using finite-element numerical models. Our work realises a real time distributed analytical environment where analysis and simulation are closely coupled; integrating high performance implementations of image mining components executing on dedicated Discovery Net servers at Imperial College London, UK and high performance implementations of finiteelement models executing at specialised servers at the University of Oklahoma, USA. Novel scientific results produced using our data sets provide a valuable insight into earthquake analysis. In addition, our informatics work provides a novel high performance computing framework and methods for the application of complex knowledge discovery methods to understanding earthquake dynamics. Furthermore, the realisation of our distributed computing platform is based on the implementation of a set of open standards, making its results accessible over the Grid to the wider scientific community.
Using dragpushing to refine centroid text classifiers.

Cluster Computing and Grid 2005 Works in Progress.

InfoGrid Information Resource Integration.

InfoGrid Information Resource Integration.

IT Service Infrastructure for Integrative Systems Biology.

Prototype a Knowledge Discovery Infrastructure by Implementing Relational Grid Monitoring Architecture %28R%2DGMA%29 on European Data Grid %28EDG%29.

The discovery net system for high throughput bioinformatics.
Motivation: Bioinformatics requires Grid technologies and protocols to build high performance applications without focusing on the low level detail of how the individual Grid components operate. Result: 
The Design of Discovery Net Towards Open Grid Services for Knowledge Discovery.
Citations (this article cites 18 articles hosted on the
InfoGrid providing information integration for knowledge discovery.
Many scientific experiments produce large amounts of data using high-throughput devices. In order to analyse this type of data Knowledge Discovery systems are required. However, generic laboratory systems do not provide any contextual information about the system that is being studied. In these situations, Knowledge Discovery can be aided and validated by the use of Information integration tools. In this paper, we introduce InjbGrid, a data integration, middleware engine, designed to operate under a Grid framework. It focuses on providing information access services and offers all users a query system which is able to retain the familiarity with their spedtic sdentific applications while being diverse, flexible and open at the same time. The assumption there is that defining a common language for all queries is not desirable.

Gram%2DSchmidt Kernels Applied to Structure Activity Analysis for Drug Design.


Discovery net towards a grid of knowledge discovery.

Automatic Scientific Text Classification Using Local Patterns KDD Cup 2002 %28Task 1%29.
In this paper, we describe our approach for addressing Task 1 in the KDD CUP 2002 competition. The approach is based on developing and using an improved automatic feature selection method in conjunction with traditional classifiers. The feature selection method used is based on capturing frequently occurring keyword combinations (or motifs) within short segments of the text of a document and has proved to produce more accurate classification results than approaches relying solely on using keyword-based features.
Option pricing under model and parameter uncertainty using predictive densities.
The theoretical price of a financial option is given by the expectation of its discounted expiry time payoff. The computation of this expectation depends on the density of the value of the underlying instrument at expiry time. This density depends on both the parametric model assumed for the behaviour of the underlying, and the values of parameters within the model, such as volatility. However neither the model, nor the parameter values are known. Common practice when pricing options is to assume a specific model, such as geometric Brownian Motion, and to use point estimates of the model parameters, thereby precisely defining a density function. We explicitly acknowledge the uncertainty of model and parameters by constructing the predictive density of the underlying as an average of model predictive densities, weighted by each model&#039;s posterior probability. A model&#039;s predictive density is constructed by integrating its transition density function by the posterior distribution of its parameters. This is an extension to Bayesian model averaging. Sampling importance-resampling and Monte Carlo algorithms implement the computation. The advantage of this method is that rather than falsely assuming the model and parameter values are known, inherent ignorance is acknowedged and dealt with in a mathematically logical manner, which utilises all information from past and current observations to generate and update option prices. Moreover point estimates for parameters are unnecessary. We use this method to price a European Call option on a share index.
Design of Problem%2DSolving Environment for Contingent Claim Valuation.

Minimised Geometric Buchberger Algorithm for Integer Programming.

Developing a distributed scalable Java component server.

Developing A Distributed Scalable Enterprise JavaBean Server.

New paradigms in information visualization.
We present three new visualization front-ends that aid navigation through the set of documents returned by a search engine (hit documents). We cluster the hit documents to visually group these documents and label the groups with related words. The different front-ends cater for different user needs, but all can browse cluster information as well as drilling up or down in one or more clusters and refining the search using one or more of the suggested related keywords.
Parallel pseudospectral solution of financial partial differential equations.

Design of high performance financial modelling environment.
The aim of our system is to generate solution code from a high level specification of a financial instrument. Solution code calculates prices and hedge ratios which are partial derivatives of the price with respect to various parameters. The user manipulates a representation of the problem at the domain level, with the complexities of the computer implementation hidden. As many of the problems have no analytical solution, symbolic transformations manipulate the equations specifying the stochastic model and instrument into forms that can be solved numerically. Techniques such as finite differences, spectral methods and Monte Carlo simulation are provided in sequential and parallel versions. The mathematical correctness of the transformation steps is examinable as is the degree of error introduced by approximating transformations. We include examples for the Black-Scholes model and for the Hull White stochastic volatility model. A Linux cluster is used to price an Asian option using the Hull White SV model.
An Architecture for Distributed Enterprise Data Mining.
The requirements for data mining systems for large organisations and enterprises range from logical and physical distribution of large data and heterogeneous computational resources to the general need for high performance at a level that is sufficient for interactive work. This work categorises the requirements and describes the Kensington software architecture that addresses these demands. The system is capable of transparently supporting parallel computation at two levels, and we describe a configuration for trans-atlantic distributed parallel data mining that was demonstrated at the recent Supercomputing conference.
Probing Knowledge in Distributed Data Mining.

A Visual Language for Internet%2DBased Data Mining and Data Visualization.

Editorial.
calls &amp; calendarEDITORIAL
Distributed Haskell Goffin on the Internet.
The constraint functional language GOFFIN extends the purely functional Haskell with combinators from concurrent....
A Software Architecture for Deploying High Performance Solution on the Internet.

GOFFIN Higher%2DOrder Functions Meet Concurrent Constraints.
ions Like Haskell, Goffin is strongly typed. We introduce the type O for constraints, and call functions of type ff ! O constraint abstractions; they may get constraints or other constraint abstractions as arguments, giving higherorder constraint abstractions. Reconsider the function map. It applies a function f over a list, yielding a list of result values. When f has to perform a sufficient amount of work for each list element, it may be desirable to compute the elements of the resulting list in parallel. Such a behaviour is specified by the constraint abstraction farm: farm :: (ff ! fi) ! [ff] ! [fi] ! O farm f [] r ) fr / []g  farm f (x : xs) r ) fys in r / (f x ) : ys; farm f xs ysg  In essence, a constraint of the form fr in farm foo [a 1 ; : : : ; a n ] rg unfolds to  fr ; ys 1 ; : : : ; ys n in r / (foo a 1 ) : ys 1 ;  ys 1 / (foo a 2 ) : ys 2 ;  . . .  ys n\Gamma1 / (foo a n ) : ys n ;  ys n / []g Again, constraints are used as a means to organize the parallel reduction of a s...
Enlarging the Scope of Vector%2DBased Computations Extending Fortran 90 by Nested Data Parallelism.
This paper describes the integration of nested data parallelism into Fortran 90. Unlike flat data parallelism, nested data parallelism directly provides means for handling irregular data structures and certain forms of control parallelism, such as divideand -conquer algorithms, thus enabling the programmer to express such algorithms far more naturally. Existing work deals with nested data parallelism in a functional environment, which does help avoid a set of problems, but makes efficient implementations more complicated. Moreover, functional languages are not readily accepted by programmers used to languages, such as Fortran and C, which are currently predominant in programming parallel machines. In this paper, we introduce the imperative data-parallel language Fortran 90V and give an overview of its implementation.  1 Introduction  Vector computers are one of the most successful architectures for high-performance computing. They offer fine-grain data parallelism, enabling one operati...
Parallel Induction Algorithms for Data Mining.
. In the last decade, there has been an explosive growth in  the generation and collection of data. Nonetheless, the quality of information  inferred from this voluminous data has not been proportional  to its size. One of the reasons for this is that the computational complexities  of the algorithms used to extract information from the data are  normally proportional to the number of input data items resulting in  prohibitive execution time on large data sets. Parallelism is one solution  to this problem. In this paper we present preliminary results on experiments  in parallelising C4.5, a classification-rule learning system using  decision-trees as a model representation, which has been used as a base  model for investigating methods for parallelising induction algorithms.  The experiments assess the potential for improving the execution time  by exploiting parallelism in the algorithm.  1 Introduction  In the last decade there has been an explosive growth in the generation and colle...
The Minimised Geometric Buchberger Algorithm An Optimal Algebraic Algorithm for Integer Programming.

Large Scale Data Mining Challenges and Responses.

Parallelizing Conditional Recurrences.

Co%2Dordinating Heterogeneous Parallel Computation.
. There is a growing interest in heterogeneous high performance  computing environments. These systems are difficult to program  owing to the complexity of choosing the appropriate resource allocations  and the difficulties in expressing these choices in traditional parallel languages.  In this paper we propose that functional skeletons are used to  express these resource allocation strategies. By associating performance  models with each skeleton it is possible to predict and optimise the performance  of different resource allocation strategies, thus providing a tool  for guiding the choice of resource allocation. Through a case study of a  parallel conjugate gradient algorithm on a mixed vector and scalar parallel  machine we demonstrate these features of the SPP(X) approach.  1 Introduction  Parallel computation platforms often now have a heterogeneous structure arising from either exploiting clusters of workstations or from using parallel computers with specialist hardware such as ...
Functional Skeletons for Parallel Coordination.
. In this paper we propose a methodology for structured parallel  programming using functional skeletons to compose and coordinate  concurrent activities written in a standard imperative language. Skeletons  are higher order functional forms with built-in parallel behaviour.  We show how such forms can be used uniformly to abstract all aspects  of a parallel program&#039;s behaviour including data partitioning, placement  and re-arrangement (communication) as well as computation. Skeletons  are naturally data parallel and are capable of expressing computation and  co-ordination at a higher level of abstraction than other process oriented  co-ordination notations. Examples of the application of this methodology  are given and an implementation technique outlined.  1 Introduction  This paper proposes the use of skeletons as a coordination language for programming parallel architectures. The coordination language model, as proposed by Gelernter and Carriero, builds parallel programs out of two...
Parallel Skeletons for Structured Composition.
In this paper, we propose a straightforward solution to the problems of compositional parallel programming by using skeletons as the uniform mechanism for structured composition. In our approach parallel programs are constructed by composing procedures in a conventional base language using a set of high-level, predefined, functional, parallel computational forms known as skeletons . The ability to compose skeletons provides us with the essential tools for building further and more complex application-oriented skeletons specifying important aspects of parallel computation. Compared with the process network based composition approach, such as PCN, the skeleton approach abstracts away the fine details of connecting communication ports to the higher level mechanism of making data distributions conform, thus avoiding the complexity of using lower level ports as the means of interaction. Thus, the framework provides a natural integration of the compositional programming approach with the dat...
Co%2Dordinating Parallel Computation through Equational Constraints.

Constraint Logic Programming in the Sequent Calculus.
. In this paper, we are developing a new logical semantics of CLP. It is shown that CLP is based on an amalgamated logic embedding the entailment relation of constraints into a fragment of intuitionistic logic. Constrained SLD resolution corresponds to a complete proof search in the amalgamated logic. The framework provides not only the logical account on the definitional semantics towards CLP but also a general way to integrate constraints into various logic programming systems. 1 Introduction  Constraint logic programming has recently attracted much research actively. Intuitively, constraint logic programming languages are designed by replacing unification with constraint solving over a computational domain. Therefore, logic programming can be pursued over any intended domain of discourse. Many CLP languages has been designed [JL87, Col87] and implemented [JL87, Col87]. Their computational domains include linear arithmetic[JL87], boolean algebra [KS89] and finite sets [MHS88]. Since ...
Formalising Actors in Linear Logic.
We present a logical formalism of the actor-based concurrent object oriented computation in terms of the deduction in linear logic. By encoding messages and objects in the actor model as formulae of linear logic, the distributed state of the actor computation, regarded as a configuration, can be represented as a multiset of object formulae and message formulae. Methods are encoded as a special form of logical implication describing the effect of the communication between objects and messages. With this logical encoding, actor based concurrent computation can be fully modelled as a deduction procedure in linear logic. In the paper, we provide a detailed mapping of the actor model into the logical system. It is shown that, with such a mapping, the logical semantics of actors can be developed. 1 Introduction  Concurrent interaction between objects is an intrinsic feature of object oriented systems. However, this feature has not been formally studied since there seems to exist no agreement...
Functional Programming Languages with Logical Variables A Linear Logic View.
The idea of introducing logical variables into functional programming languages has been proposed for some years, and many concrete languages with this feature have been developed. Recently the semantic features of the languages in this paradigm have been uniformly modelled using the constraint computation formalism [RJK92]. However, the operational behaviour of these languages has not been studied systematically. In this paper, we propose a linear logic formalization of the the computational behaviour of functional programming languages with logical variables. It is shown that, with the resource-consciousness of linear logic, the computation of the paradigm can be uniformly modelled as deduction in the logic. Therefore, the model provides the logical meaning for the computation as well as a general abstract machine for the implementation of these languages. 1 Introduction  Functional computation is concerned with the evaluation of ground expressions. In a functional program variables ...
A New Perspective on Integrating Functional and Logic Languages.
Traditionally the integration of functional and logic languages is performed by attempting to integrate their semantic logics in some way. Many languages have been developed by taking this approach, but none manages to exploit fully the programming features of both functional and logic languages and provide a smooth integration of the two paradigms. We propose that improved integrated systems can be constructed by taking a broader view of the underlying semantics of logic programming. A novel integrated language paradigm, Definitional Constraint Programming (DCP), is proposed. DCP generalises constraint logic programming by admitting user-defined functions via a purely functional subsystem and enhances it with the power to solve constraints over functional programs. This constraint approach to integration results in a homogeneous unified system in which functional and logic programming features are combined naturally.  1 Introduction  During the past ten years the integration of funct...
A General Computational Scheme for Constraint Logic Programming.
In this paper we propose a novel computational model for constraint logic programming (CLP) languages. The model provides an efficient mechanism for executing CLP programs by exploiting constraint satisfaction as a means for both solving constraints and controlling the whole computation. In the model, we separate constraint solving from the deduction procedure. Deductions over constraints are extracted from the source program and represented as a context-free grammar that encodes the way in which deduction will generate constraints to be solved. Therefore, deduction is performed abstractly at compile time. Executing the grammar generates all the constraints that need to be solved at run time. A very flexible control mechanism is therefore provided by the model in terms of the information fed back from the constraint solving procedure. It is shown that the model provides a general scheme for investigating an efficient computational model for implementing constraint logic programming sys...
Introducing Constraint Functional Logic Programming.

A Design Space for Integrating Declarative Languages.

Constrained Equational Deduction.

Narrowing and Unification in Functional Programming %2D An Evaluation Mechanism for Absolute Set Abstraction.

